Discriminant Laplacian Embedding.



Image Categorization Using Directed Graphs.

Multi%2Dlabel Feature Transform for Image Classifications.

Multi%2Dlabel Linear Discriminant Analysis.

Improved MinMax Cut Graph Clustering with Nonnegative Relaxation.

Directed Graph Learning via High%2DOrder Co%2Dlinkage Analysis.

Face Aging by Sparse Representation.

Face Aging by Sparse Representation.

An interactive user interface system for Alzheimer%27s intervention.

Emotion detection via discriminative kernel method.

Mass spectrometry data processing using zero%2Dcrossing lines in multi%2Dscale of Gaussian derivative wavelet.

Solenoid and non%2Dsolenoid protein recognition using stationary wavelet packet transform.

On the eigenvectors of p%2DLaplacian.
We present a generalized version of spectral clustering using the graph p-Laplacian, a nonlinear generalization of the standard graph Laplacian. We show that the second eigenvector of the graph p-Laplacian interpolates between a relaxation of the normalized and the Cheeger cut. Moreover, we prove that in the limit as p → 1 the cut found by thresholding the second eigenvector of the graph p-Laplacian converges to the optimal Cheeger cut. Furthermore, we provide an efficient numerical scheme to compute the second eigenvector of the graph p-Laplacian. The experiments show that the clustering found by p-spectral clustering is at least as good as normal spectral clustering, but often leads to significantly better results. 1.
On the eigenvectors of p%2DLaplacian.
We present a generalized version of spectral clustering using the graph p-Laplacian, a nonlinear generalization of the standard graph Laplacian. We show that the second eigenvector of the graph p-Laplacian interpolates between a relaxation of the normalized and the Cheeger cut. Moreover, we prove that in the limit as p → 1 the cut found by thresholding the second eigenvector of the graph p-Laplacian converges to the optimal Cheeger cut. Furthermore, we provide an efficient numerical scheme to compute the second eigenvector of the graph p-Laplacian. The experiments show that the clustering found by p-spectral clustering is at least as good as normal spectral clustering, but often leads to significantly better results. 1.
Link prediction of multimedia social network via unsupervised face recognition.

Heterogeneous Data Fusion to Type Brain Tumor Biopsies.

Symmetric two dimensional linear discriminant analysis %282DLDA%29.

Non%2Dnegative Laplacian Embedding.

Are Tensor Decomposition Solutions Unique%3F On the global convergence of HOSVD and ParaFac algorithms

Peak Detection in Mass Spectrometry by Gabor Filters and Envelope Analysis.

Robust tensor factorization using R1 norm.

Tensor reduction error analysis %2D Applications to video compression and classification.
Tensor based dimensionality reduction has recently been extensively studied for computer vision applications. To our knowledge, however, there exist no rigorous error analysis on these methods. Here we provide the first error analysis of these methods and provide error bound results similar to Eckart-Young Theorem which plays critical role in the development and application of singular value decomposition (SVD). Beside performance guarantee, these error bounds are useful for subspace size determination according to the required video/image reconstruction error. Furthermore, video surveillance/retrieval, 3D/4D medical image analysis, and other computer vision applications require particular reduction in spatio-temporal space, but not along data index dimension. This motivates a D-1 tensor reduction. Standard method such as high order SVD (HOSVD) compress data in all index dimensions and thus can not perform the classification and pattern recognition tasks. We provide algorithm and error bound analysis of the D-1 factorization for spatio-temporal data dimensionality. Experiments on video sequences demonstrate our approach outperforms the previous dimensionality deduction methods for spatiotemporal data. 1.
High dimensional statistical shape model for medical image analysis.



Requirements for implementation of localization into real%2Dworld assistive environments.

A New Smoothing Model for Analyzing Array CGH Data.

A New Hybrid Technique for Dermatological Image Registration.

Denoising of Array%2DBased DNA Copy Number Data Using The Dual%2Dtree Complex Wavelet Transform.

Morphometric Analysis of Hippocampal Shape in Mild Cognitive Impairment An Imaging Genetics Study.
Abstract—A computational framework is presented for surface based morphometry to localize shape changes between groups of 3D objects. It employs the spherical harmonic (SPHARM) method for surface modeling and random field theory (RFT) for statistical inference. Several new components are introduced to overcome previous limitations: (1) a general linear model is used to facilitate controlling for covariates; (2) a new SPHARM registration method SHREC is proposed to better align SPHARM models; and (3) an estimated smoothness is used in RFT-based analysis to obtain more accurate results. This framework is applied in a mild cognitive impairment (MCI) study to examine hippocampal shape changes related to diagnostic and genetic conditions. Several interesting findings from our analyses suggest combining imaging phenotypes and genetic profiles has the potential to elucidate biological pathways for better understanding MCI and Alzheimer’s disease. I.
Surface Harmonics for Shape Modeling.

Efficient Registration of 3D SPHARM Surfaces.

Surface Harmonics for Shape Modeling.

A garbage%2Dcollecting typed assembly language.
Abstract. Typed programming languages offer safety guarantees that help programmers write correct code, but typical language implementations offer no proof that source-level guarantees extend to executable code. Moreover, typical implementations link programs with unsafe runtime system (RTS) code. I present a compiler for the functional language Haskell that preserves some of the properties of Haskell’s type system. The soundness proof for the combination of the compiler and a verified RTS requires a proof that the compiler emits code that cooperates correctly with the RTS. In particular, the latter proof must address the boundary between the user program and the garbage collector. In this paper, I introduce a minimalist intermediate language type system that ensures that well-typed programs cannot make the garbage collector go wrong. I also discuss compilation strategies that allow simplifying the RTS. The work I present in this paper yields a simple and safe compilation system. 1
A garbage%2Dcollecting typed assembly language.
Abstract. Typed programming languages offer safety guarantees that help programmers write correct code, but typical language implementations offer no proof that source-level guarantees extend to executable code. Moreover, typical implementations link programs with unsafe runtime system (RTS) code. I present a compiler for the functional language Haskell that preserves some of the properties of Haskell’s type system. The soundness proof for the combination of the compiler and a verified RTS requires a proof that the compiler emits code that cooperates correctly with the RTS. In particular, the latter proof must address the boundary between the user program and the garbage collector. In this paper, I introduce a minimalist intermediate language type system that ensures that well-typed programs cannot make the garbage collector go wrong. I also discuss compilation strategies that allow simplifying the RTS. The work I present in this paper yields a simple and safe compilation system. 1


Three%2Ddimensional Models for Cardiac Bioelectricity Simulation Cell to Organ.

A Spatio%2DTemporal Modeling Method for Shape Representation.

Hemispherical Harmonic Surface Description and Applications to Medical Image Analysis.

K%2Dmeans  Method for Improving Gene Selection for Classification of Microarray Data.
Microarray gene expression techniques have recently made it possible to offer phenotype classification of many diseases. One problem in this analysis is that each sample is represented by quite a large number of genes, and many of them are insignificant or redundant to clarify the disease problem. The previous work has shown that selecting informative genes from microarray data can improve the accuracy of classification. Clustering methods have been successfully applied to group similar genes and select informative genes from them to avoid redundancy and extract biological information from them. A problem with these approaches is that the number of clusters must be given and it is time-consuming to try all possible numbers for clusters. In this paper, a heuristic, called K-means+, is used to address the number of clusters dependency and degeneracy problems. The result of our experiments shows that K-means+ method can automatically partition genes into a reasonable number of clusters and then the informative genes are selected from clusters. 1.
Surface Alignment of 3D Spherical Harmonic Models Application to Cardiac MRI Analysis.
Abstract. The spherical harmonic (SPHARM) description is a powerful surface modeling technique that can model arbitrarily shaped but simply connected 3D objects and has been used in many applications in medical imaging. Previous SPHARM techniques use the first order ellipsoid for establishing surface correspondence and aligning objects. However, this first order information may not be sufficient in many cases; a more general method for establishing surface correspondence would be to minimize the mean squared distance between two corresponding surfaces. In this paper, a new surface matching algorithm is proposed for 3D SPHARM models to achieve this goal. This algorithm employs a useful rotational property of spherical harmonic basis functions for a fast implementation. Applications of medical image analysis (e.g., spatio-temporal modeling of heart shape changes) are used to demonstrate this approach. Theoretical proofs and experimental results show that our approach is an accurate and flexible surface correspondence alignment method. This surface matching algorithm can be integrated into an ICP-like framework for registration of 3D parametric surfaces. 1
A Prediction Framework for Cardiac Resynchronization Therapy Via 4D Cardiac Motion Analysis.
Abstract. We propose a novel framework to predict pacing sites in the left ventricle (LV) of a heart and its result can be used to assist pacemaker implantation and programming in cardiac resynchronization therapy (CRT), a widely adopted therapy for heart failure patients. In a traditional CRT device deployment, pacing sites are selected without quantitative prediction. That runs the risk of suboptimal benefits. In this work, the spherical harmonic (SPHARM) description is employed to model the ventricular surfaces and a novel SPHARM-based surface correspondence approach is proposed to capture the ventricular wall motion. A hierarchical agglomerative clustering technique is applied to the time series of regional wall thickness to identify candidate pacing sites. Using clinical MRI data in our experiments, we demonstrate that the proposed framework can not only effectively identify suitable pacing sites, but also distinguish patients from normal subjects perfectly to help medical diagnosis and prognosis. 1

A New Test System for Stability Measurement of Marker Gene Selection in DNA Microarray Data Analysis.


Custom design of facility layouts for multiproduct facilities using layout modules.

